Triangulating stable laminations
نویسندگان
چکیده
We study the asymptotic behavior of random simply generated noncrossing planar trees in the space of compact subsets of the unit disk, equipped with the Hausdorff distance. Their distributional limits are obtained by triangulating at random the faces of stable laminations, which are random compact subsets of the unit disk made of non-intersecting chords coded by stable Lévy processes. We also study other ways to “fill-in” the faces of stable laminations, which leads us to introduce the iteration of laminations and of trees.
منابع مشابه
Persistence of stratification of normally expanded laminations
This manuscript complements the Hirsch-Pugh-Shub (HPS) theory on persistence of normally hyperbolic laminations and the theorem of Robinson on the structural stability of diffeomorphisms that satisfy Axiom A and the strong transversality condition (SA). We generalize these results by introducing a geometric object: the stratification of laminations. It is a stratification whose strata are lamin...
متن کاملDissecting the circle, at random∗
Random laminations of the disk are the continuous limits of random non-crossing configurations of regular polygons. We provide an expository account on this subject. Initiated by the work of Aldous on the Brownian triangulation, this field now possesses many characters such as the random recursive triangulation, the stable laminations and the Markovian hyperbolic triangulation of the disk. We w...
متن کاملCoding Non-orientable Laminations
Surface laminations are classic closed sets of disjoint curves in surfaces. We give here a full description of how to obtain codings of such laminations when they are non-orientable by using lamination languages, i.e. specific linear complexity languages of two-way infinite words. We also compare lamination languages with symbolic laminations, i.e. the coding counterparts of algebraic laminations.
متن کاملOn the classification of laminations associated to quadratic polynomials
Given any rational map f , there is a lamination by Riemann surfaces associated to f . Such laminations were constructed in general by Lyubich and Minsky. In this paper, we classify laminations associated to quadratic polynomials with periodic critical point. In particular, we prove that the topology of such laminations determines the combinatorics of the parameter. We also describe the topolog...
متن کاملR-trees and laminations for free groups I: Algebraic laminations
This paper is the first of a sequence of three papers, where the concept of an Rtree dual to (the lift to the universal covering of) a measured geodesic lamination L in a hyperbolic surface S is generalized to arbitrary R-trees provided with a (very small) action of the free group FN of finite rank N ≥ 2 by isometries. In [CHL-II] to any such R-tree T a dual algebraic lamination L(T ) is associ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017